Minimum moves to equal array elements

Time: O(N); Space: O(1); easy

Given a non-empty integer array of size N, find the minimum number of moves required to make all array elements equal, where a move is incrementing (N - 1) elements by 1.

Example 1:

Input: nums = [1, 2, 3]

Output: 3

Explanation:

  • Only three moves are needed (remember each move increments two elements):

  • [1,2,3] => [2,3,3] => [3,4,3] => [4,4,4]

[1]:

class Solution1(object):
    def minMoves(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        return sum(nums) - len(nums) * min(nums)

[2]:

s = Solution1()
A = [1,2,3]
assert s.minMoves(A) == 3